Srikumar 1 Perfect Matching and Matching Polytopes
نویسنده
چکیده
منابع مشابه
Gorenstein Polytopes Obtained from Bipartite Graphs
Beck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result, that is, we characterize the torus graphs whose perfect matching polytopes are Gorenstein. Beck et. al. also gave a method to construct an infinite family of...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملA TDI Description of Restricted 2-Matching Polytopes
We give a TDI description for a class of polytopes which corresponds to a restricted 2-matching problem. The perfect matching polytope, triangle-free perfect 2-matching polytope and relaxations of the traveling salesman polytope are members of this class. For a class of restrictions G. Cornuéjols, D. Hartvigsen and W.R. Pulleyblank have shown that the unweighted problem is tractable; here we sh...
متن کاملOn Matroid Parity and Matching Polytopes∗
The matroid parity (MP) problem is a natural extension of the matching problem to the matroid setting. It can be formulated as a 0− 1 linear program using the so-called rank and line constraints. We call the associated family of polytopes MP polytopes. We then prove the following: (i) when the matroid is a gammoid, each MP polytope is a projection of a perfect matching polytope into a suitable ...
متن کاملA characterization of PM-compact bipartite and near-bipartite graphs
The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. We characterise bipartite graphs and near-bipartite graphs whose perfect matching polytopes have diameter 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010